Delzant’s T-invariant, Kolmogorov Complexity and One-relator Groups
نویسندگان
چکیده
We prove that for " random " one-relator groups the Delzant T-invariant (which measures the smallest size of a finite presentation of a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding isomorphism rigidity of generic one-relator groups and on the methods of the theory of Kolmogorov-Chaitin complexity.
منابع مشابه
Delzant’s T-invariant and One-relator Groups
We prove that for " most " one-relator groups Delzant's T-invariant (which measures the smallest size of a finite presentation for a group) is comparable in magnitude with the length of the defining relator. The proof relies on our previous results regarding algebraic rigidity of generic one-relator groups and on the methods of algorithmic probability involving Kolmogorov-Chaitin complexity.
متن کاملDelzant’s variation on Scott Complexity
We give an exposition of Delzant’s ideas extending the notion of Scott complexity of finitely generated groups to surjective homomorphisms from finitely presented groups.
متن کاملGeneric properties of Whitehead's Algorithm and isomorphism rigidity of random one-relator groups
We prove that Whitehead’s algorithm for solving the automorphism problem in a fixed free group Fk has strongly linear time generic-case complexity. This is done by showing that the “hard” part of the algorithm terminates in linear time on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random...
متن کاملGeneric properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups
We show that the " hard " part of Whitehead's algorithm for solving the automorphism problem in a fixed free group F k terminates in linear time (in terms of the length of an input) on an exponentially generic set of input pairs and thus the algorithm has strongly linear-time generic-case complexity. We also prove that the stabilizers of generic elements of F k in Aut(F k) are cyclic groups gen...
متن کاملReflections on the residual finiteness of one-relator groups
Let G D ha; b; : : : j r D 1i be a one-relator group equipped with at least two generators. For all w which do not commute with r in the ambient free group on the generators a, b, ..., the groups G.r;w/ D ha; b; : : : j rrw D r2i are not residually finite and have the same finite images as G. The existence of this family of one-relator groups which are not residually finite reinforces what is b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005